The Expected Performance of Traversal Algorithms in Binary Trees

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected Shape of Random Binary Search Trees

This entry contains proofs for the textbook results about the distributions of the height and internal path length of random binary search trees (BSTs), i. e. BSTs that are formed by taking an empty BST and inserting elements from a fixed set in random order. In particular, we prove a logarithmic upper bound on the expected height and the Θ(n log n) closed-form solution for the expected interna...

متن کامل

the relationship between learners critical thinking ability and their performance in the reading sections of the tofel and ielts test

the study reflected in this thesis aims at finding out relationships between critical thinking (ct), and the reading sections of tofel and ielts tests. the study tries to find any relationships between the ct ability of students and their performance on reading tests of tofel and academic ielts. however, no research has ever been conducted to investigate the relationship between ct and the read...

15 صفحه اول

the role of application of dynamic assessment approach in improvement of iranian efl writing performance at different language proficiency levels

the present study sought to investigate the role of dynamic assessment (da) in improvement of iranian efl writing performance at different language proficiency levels. to this end, after conducting the quick placement test, 60 iranian efl learners were assigned to two groups with different language proficiency levels. in both groups each participant wrote two compositions, one before and one af...

Inorder traversal of splay trees

Splay trees, a form of self-adjusting binary tree, were introduced by Sleator and Tarjan in the early 1980s. Their main use is to store ordered lists. The idea is to keep the trees reasonably well balanced through a ‘splay heuristic.’ Sleator and Tarjan showed that if amortised rather than worst-case times are considered, splay trees are optimal. Splay trees have the advantage of simplicity: th...

متن کامل

the effect of task complexity on efl learners’ written task performance in terms of accuracy and complexity

هدف اصلی این تحقیق بررسی تاثیر افزایش میزان پیچیدگی تکالیف مکالمه محور بر دقت و صحت و پیچیدگی عملکرد نوشتاری زبان آموزان می باشد. بدین منظور، 50 نفر از دانش آموزان دختر در رده ی سنی 15 الی 18 سال درسطح pre-intermediate از طریق petو vhs تست به عنوان شرکت کنندگان در تحقیق انتخاب شدند و به دو گروه آزمایشی و کنترل بصورت اتفاقی تقسیم شدند. اعضای گروه آزمایشی دو تکلیف ساده و پیچیده را طی 2 جلسه انجام...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 1985

ISSN: 0010-4620,1460-2067

DOI: 10.1093/comjnl/28.4.426